Multiple Paradigms for Automating Map Generalization: Geometry, Topology, Hierarchical Partioning and Local Triangulation

نویسنده

  • Anne RUAS
چکیده

Generalization may be defined as a controlled reduction and simplifica tion of geographical data. Despite the knowledge of basic generalization operators, the automation of generalization remains a complex issue. Ac tually the change in resolution induces numerous spatial conflicts and the use of generalization operators such as smoothing or aggregation may ac cidentally degrade geographical data. The aim of this paper is to propose a set of paradigms necessary to automate generalization. Firstly a space partitioning computed from structuring objects allows to define some working areas and to give a pre-sequence of transformations in the proc ess of generalization. Then some local Delaunay triangulations allow to compute proximity relations between non-connected objects and to propa gate displacements due to some geometric transformations. To ensure consistency during different geometric changes, both paradigms are inte grated with a classical topo-metric structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shape-Based 3D Surface Correspondence Using Geodesics and Local Geometry

This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature. An initial sparse set of corresponding points are generated using a shapebased matching procedure. Geodesic interpolation is employed in order to capture the complex surface. In addition, surface correspondence and tr...

متن کامل

Dynamic Delaunay tetrahedralizations and Voronoi tessellations in three dimensions

We describe the implementation of an incremental insertion algorithm to construct and maintain three-dimensional Delaunay triangulations with dynamic vertices using a three-simplex data structure. The code is capable of constructing the geometric dual, the Voronoi or Dirichlet tesselation. A given list of generators is triangulated and volumes as well as contact surfaces of the Dirichlet region...

متن کامل

Generalized Swap Operation for Tetrahedrizations

Mesh optimization of 2D and 3D triangulations is used in multiple applications extensively. For example, mesh optimization is crucial in the context of adaptively discretizing geometry, typically representing the geometrical boundary conditions of a numerical simulation, or adaptively discretizing the entire space over which various dependent variables of a numerical simulation must be approxim...

متن کامل

Affine schemes in Mesh-Based Video Motion Compensation

We evaluate performances of different implementations of affine transform in motion compensation architecture based on a hierarchical adaptive structured mesh. The architecture predicts the next video frame using the reference frame, mesh code and mesh node motion vectors. It achieves significant reduction in describing the mesh topology by coding the splitting in recursive triangulation of the...

متن کامل

On the pointfree counterpart of the local definition of classical continuous maps

The familiar classical result that a continuous map from a space $X$ to a space $Y$ can be defined by giving continuous maps $varphi_U: U to Y$ on each member $U$ of an open cover ${mathfrak C}$ of $X$ such that $varphi_Umid U cap V = varphi_V mid U cap V$ for all $U,V in {mathfrak C}$ was recently shown to have an exact analogue in pointfree topology, and the same was done for the familiar cla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008